lst = input().split()
lst = [int(i) for i in lst]
if sum(lst) % 5 == 0 and sum(lst) != 0:
print(int(sum(lst) / 5))
else:
print(-1)//sol 5369666174
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,out=0;
cin>>a>>b>>c>>d>>e;
out=a+b+c+d+e;
if((out%5)||(out==0))cout<<-1<<endl;
else cout<<out/5<<endl;
}
206. Reverse Linked List | 83. Remove Duplicates from Sorted List |
116. Populating Next Right Pointers in Each Node | 145. Binary Tree Postorder Traversal |
94. Binary Tree Inorder Traversal | 101. Symmetric Tree |
77. Combinations | 46. Permutations |
226. Invert Binary Tree | 112. Path Sum |
1556A - A Variety of Operations | 136. Single Number |
169. Majority Element | 119. Pascal's Triangle II |
409. Longest Palindrome | 1574A - Regular Bracket Sequences |
1574B - Combinatorics Homework | 1567A - Domino Disaster |
1593A - Elections | 1607A - Linear Keyboard |
EQUALCOIN Equal Coins | XOREQN Xor Equation |
MAKEPAL Weird Palindrome Making | HILLSEQ Hill Sequence |
MAXBRIDGE Maximise the bridges | WLDRPL Wildcard Replacement |
1221. Split a String in Balanced Strings | 1002. Find Common Characters |
1602A - Two Subsequences | 1555A - PizzaForces |